On structural properties of trees with minimal atom-bond connectivity index II

نویسنده

  • Darko Dimitrov
چکیده

The atom-bond connectivity (ABC) index is a degree-based graph topological index that found chemical applications. The problem of complete characterization of trees with minimal ABC index is still an open problem. In [14], it was shown that trees with minimal ABC index do not contain so-called Bk-branches, with k ≥ 5, and that they do not have more than four B4-branches. Our main results here reveal that the number of B1 and B2-branches are also bounded from above by small fixed constants. Namely, we show that trees with minimal ABC index do not contain more than four B1-branches and more than eleven B2-branches.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On structural properties of trees with minimal atom-bond connectivity index

The atom-bond connectivity (ABC) index is a degree-based molecular descriptor, that found chemical applications. It is well known that among all connected graphs, the graphs with minimal ABC index are trees. A complete characterization of trees with minimal ABC index is still an open problem. In this paper, we present new structural properties of trees with minimal ABC index. Our main results r...

متن کامل

On Second Atom-Bond Connectivity Index

The atom-bond connectivity index of graph is a topological index proposed by Estrada et al. as ABC (G)  uvE (G ) (du dv  2) / dudv , where the summation goes over all edges of G, du and dv are the degrees of the terminal vertices u and v of edge uv. In the present paper, some upper bounds for the second type of atom-bond connectivity index are computed.

متن کامل

On generalized atom-bond connectivity index of cacti

The generalized atom-bond connectivity index of a graph G is denoted by ABCa(G) and defined as the sum of weights ((d(u)+d(v)-2)/d(u)d(v))aa$ over all edges uv∊G. A cactus is a graph in which any two cycles have at most one common vertex. In this paper, we compute sharp bounds for  ABCa index for cacti of order $n$ ...

متن کامل

A Note on Atom Bond Connectivity Index

The atom bond connectivity index of a graph is a new topological index was defined by E. Estrada as ABC(G)  uvE (dG(u) dG(v) 2) / dG(u)dG(v) , where G d ( u ) denotes degree of vertex u. In this paper we present some bounds of this new topological index.

متن کامل

On structural properties of trees with minimal atom-bond connectivity index IV: Solving a conjecture about the pendent paths of length three

The atom-bond connectivity (ABC) index is one of the most investigated degreebased molecular structure descriptors with a variety of chemical applications. It is known that among all connected graphs, the trees minimize the ABC index. However, a full characterization of trees with a minimal ABC index is still an open problem. By now, one of the proved properties is that a tree with a minimal AB...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Applied Mathematics and Computation

دوره 282  شماره 

صفحات  -

تاریخ انتشار 2016